Chordal embeddings of planar graphs
نویسندگان
چکیده
Robertson and Seymour conjectured that the treewidth of a planar graph and the treewidth of its geometric dual differ by at most one. Lapoire solved the conjecture in the affirmative, using algebraic techniques. We give here a much shorter proof of this result.
منابع مشابه
Complement of Special Chordal Graphs and Vertex Decomposability
In this paper, we introduce a subclass of chordal graphs which contains $d$-trees and show that their complement are vertex decomposable and so is shellable and sequentially Cohen-Macaulay.
متن کاملNew representation results for planar graphs
A universal representation theorem is derived that shows any graph is the intersection graph of one chordal graph, a number of co-bipartite graphs, and one unit interval graph. Central to the the result is the notion of the clique cover width which is a generalization of the bandwidth parameter. Specifically, we show that any planar graph is the intersection graph of one chordal graph, four co-...
متن کاملRemarks on the Complexity of Non-negative Signed Domination
This paper is motivated by the concept of nonnegative signed domination that was introduced by Huang, Li, and Feng in 2013 [15]. We study the non-negative signed domination problem from the theoretical point of view. For networks modeled by strongly chordal graphs and distance-hereditary graphs, we show that the non-negative signed domination problem can be solved in polynomial time. For networ...
متن کاملThe Simultaneous Membership Problem for Chordal, Comparability and Permutation graphs
In this paper we introduce the simultaneous membership problem, defined for any graph class C characterized in terms of representations, e.g. any class of intersection graphs. Two graphs G1 and G2, sharing some vertices X (and the corresponding induced edges), are said to be simultaneous members of graph class C, if there exist representations R1 and R2 of G1 and G2 that are “consistent” on X ....
متن کاملPlanar graphs on the projective plane
It is shown that embeddings of planar graphs in the projective plane have very specific structure. By exhibiting this structure we indirectly characterize graphs on the projective plane whose dual graphs are planar. Whitney's Theorem about 2-switching equivalence of planar embeddings is generalized: Any two embeddings of a planar graph in the projective plane can be obtained from each other by ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 273 شماره
صفحات -
تاریخ انتشار 2003